Search results for "Uniform consensus"

showing 7 items of 7 documents

Distributed Consensus in Networks of Dynamic Agents

2006

Stationary and distributed consensus protocols for a network of n dynamic agents under local information is considered. Consensus must be reached on a group decision value returned by a function of the agents' initial state values. As a main contribution we show that the agents can reach consensus if the value of such a function computed over the agents' state trajectories is time invariant. We use this basic result to introduce a protocol design rule allowing consensus on a quite general set of values. Such a set includes, e.g., any generalized mean of order p of the agents' initial states. We demonstrate that the asymptotical consensus is reached via a Lyapunov approach. Finally we perfor…

Asymptotic stability; Distributed consensus protocolsEngineeringMathematical optimizationAsymptotic stabilitybusiness.industryFunction (mathematics)Network topologyUniform consensusComputer Science::Multiagent SystemsLTI system theorySet (abstract data type)Distributed consensus protocolsConsensusExponential stabilityComputer Science::Systems and ControlControl theoryexperimental mechanics Fourier transform load stepping photoelasticityGeneralized meanbusinessProceedings of the 44th IEEE Conference on Decision and Control
researchProduct

Lazy consensus for networks with unknown but bounded disturbances

2007

We consider stationary consensus protocols for networks of dynamic agents. The measure of the neighbors' state is affected by Unknown But Bounded disturbances. Here the main contribution is the formulation and solution of what we call the isin-consensus problem, where the states are required to converge in a tube of ray isin asymptotically or in finite time.

Computer Science::Multiagent SystemsDynamic agentsLazy consensusComputer scienceControl theoryMulti-agent systemBounded functionDynamic agents; Lazy consensus; Stationary consensus protocolsState (functional analysis)Stationary consensus protocolsTopologyMeasure (mathematics)Uniform consensus2007 46th IEEE Conference on Decision and Control
researchProduct

Non-linear protocols for optimal distributed consensus in networks of dynamic agents

2006

We consider stationary consensus protocols for networks of dynamic agents with fixed topologies. At each time instant, each agent knows only its and its neighbors'' state, but must reach consensus on a group decision value that is function of all the agents'' initial state. We show that the agents can reach consensus if the value of such a function is time-invariant when computed over the agents'' state trajectories. We use this basic result to introduce a non-linear protocol design rule allowing consensus on a quite general set of values. Such a set includes, e.g., any generalized mean of order p of the agents'' initial states. As a second contribution we show that our protocol design is t…

Lyapunov functionMathematical optimizationDecentralized controlGeneral Computer ScienceConsensus protocols; Decentralized control; Networks; Optimal controlUniform consensussymbols.namesakeConsensusComputer Science::Systems and ControlElectrical and Electronic EngineeringMathematicsMechanism designSupervisorbusiness.industryMechanical EngineeringRational agentDecentralised systemOptimal controlComputer Science::Multiagent SystemsConsensus protocolsControl and Systems EngineeringsymbolsArtificial intelligenceSettore MAT/09 - Ricerca OperativaNetworksbusinessGame theorySystems & Control Letters
researchProduct

Dealing with uncertainty in consensus protocols

2009

Recent results on consensus protocols for networks are presented. The basic tools and the main contribution available in the literature are considered, together with some of the related challenging aspects: estimation in networks and how to deal with disturbances is considered. Motivated by applications to sensor, peer-to-peer, and ad hoc networks, many papers have considered the problem of estimation in a consensus fashion. Here, the Unknown But Bounded (UBB) noise affecting the network is addressed in details. Because of the presence of UBB disturbances convergence to equilibria with all equal components is, in general, not possible. The solution of the e-consensus problem, where the stat…

Mathematical optimizationConsensusWireless ad hoc networkComputer scienceDistributed computingBounded functionConvergence (routing)Consensus protocol; optimizazion; disturbancesNoise (video)Laplacian matrixFocus (optics)Uniform consensus
researchProduct

MECHANISM DESIGN FOR OPTIMAL CONSENSUS PROBLEMS

2006

We consider stationary consensus protocols for networks of dynamic agents with fixed and switching topologies. At each time instant, each agent knows only its and its neighbors’ state, but must reach consensus on a group decision value that is function of all the agents’ initial state.We show that our protocol design is the solution of individual optimizations performed by the agents. This notion suggests a game theoretic interpretation of consensus problems as mechanism design problems. Under this perspective a supervisor entails the agents to reach a consensus by imposing individual objectives. We prove that such objectives can be chosen so that rational agents have a unique optimal proto…

Mathematical optimizationMechanism designDynamic agentsComputer sciencemedia_common.quotation_subjectDistributed computingmechanismcontainment controlRational agentStationary consensus protocolsNetwork topologyTopologyUniform consensusComputer Science::Multiagent SystemsSwitching topologiesComputer Science::Systems and ControlDynamic agents; Protocol design; Stationary consensus protocols; Switching topologiesSettore MAT/09 - Ricerca OperativaFunction (engineering)Protocol designProtocol (object-oriented programming)Game theoryMulti agent systemsmedia_common
researchProduct

Logical Consensus for Distributed Network Agreement

2008

In this paper we introduce a novel consensus mechanism where agents of a network are able to share logical values, or Booleans, representing their local opinions on e.g. the presence of an intruder or of a fire within an indoor environment. Under suitable joint conditions on agents? visibility and communication capability, we provide an algorithm generating a logical linear consensus system that is globally stable. The solution is optimal in terms of the number of messages to be exchanged and the time needed to reach a consensus. Moreover, to cope with possible sensor failure, we propose a second design approach that produces robust logical nonlinear consensus systems tolerating a maximum n…

Settore ING-INF/04 - AutomaticaRobustness (computer science)Computer scienceDistributed computingVisibility (geometry)Stability (learning theory)Algorithm designIntrusion detection systemdistributed systemConsensus algorithmBoolean data typelogical consensuUniform consensus
researchProduct

Distributed Consensus on Boolean Information

2009

Abstract In this paper we study the convergence towards consensus on information in a distributed system of agents communicating over a network. The particularity of this study is that the information on which the consensus is seeked is not represented by real numbers, rather by logical values or sets. Whereas the problems of allowing a network of agents to reach a consensus on logical functions of input events, and that of agreeing on set–valued information, have been separately addressed in previous work, in this paper we show that these problems can indeed be attacked in a unified way in the framework of Boolean distributed information systems. Based on a notion of contractivity for Bool…

Theoretical computer scienceDynamical systems theoryAnd-inverter graphConsensus theoremGeneral Medicinedistributed estimationUniform consensusBoolean networkSettore ING-INF/04 - AutomaticaConsensusInformation systemBoolean dynamics systemBoolean consensus algorithmStandard Boolean modelMathematics
researchProduct